Minimizing flowtime and missed due-dates in single-machine sequencing
نویسندگان
چکیده
منابع مشابه
Minimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...
متن کاملMinimizing Makespan on Single Machine with Release Dates
This paper considers the single criterion scheduling problem of minimizing makespan on a single machine with release dates. The problem is, by nature, NP-Hard, hence approximation algorithms are desired in order to solve the problem. An algorithm (called NAL) is proposed for the problem. The NAL algorithm is compared with the branch and bound (BB) method and a test algorithm (AEO) selected from...
متن کاملSafe scheduling: Setting due dates in single-machine problems
We consider single-machine stochastic scheduling models with due dates as decisions. In addition to showing how to satisfy given service-level requirements, we examine variations of a model in which the tightness of due-dates conflicts with the desire to minimize tardiness. We show that a general form of the trade-off includes the stochastic E/T model and gives rise to a challenging scheduling ...
متن کاملSetting due dates in a stochastic single machine environment
A set of n jobs with statistically independent random processing times has to be processed on a single machine without idling between jobs and without preemption. It is required to set due dates and promise them to customers. During the production stage, earliness and tardiness against the promised due dates will be penalized. The goal is to minimize the total expected penalties.We consider two...
متن کاملSingle Machine Scheduling with Distinct Due Dates under Fuzzy Environment
Single machine, distinct due dates, early/lately machine problem and fuzzy environment closely models the situation faced by ‘Just In Time’ manufacturing. The objective of this paper is to sequence the jobs on the machine, so that the total penalty cost be minimum. This cost is composed of the total earliness and the total tardiness cost. An algorithm is developed here to minimize the total pen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1990
ISSN: 0895-7177
DOI: 10.1016/0895-7177(90)90043-m